mutual optimization problems
- mutual optimization problems
иссл. опер. взаимные задачи оптимизации
See:
Англо-русский экономический словарь.
Смотреть что такое "mutual optimization problems" в других словарях:
Взаимные задачи оптимизации — [mutual optimization problems] пара задач скалярной оптимизации плана, в которых с разных сторон отыскивается наилучшее распределение дефицитных ресурсов: максимизируемая в одной из них целевая функция образует ограничивающее условие… … Экономико-математический словарь
взаимные задачи оптимизации — Пара задач скалярной оптимизации плана, в которых с разных сторон отыскивается наилучшее распределение дефицитных ресурсов: максимизируемая в одной из них целевая функция образует ограничивающее условие (ограничение) для другой, и наоборот,… … Справочник технического переводчика
Ricart-Agrawala algorithm — The Ricart Agrawala Algorithm is an algorithm for mutual exclusion on a distributed system. This algorithm is an extension and optimization of Lamport s Distributed Mutual Exclusion Algorithm, by removing the need for release messages. It was… … Wikipedia
Modern portfolio theory — Portfolio analysis redirects here. For theorems about the mean variance efficient frontier, see Mutual fund separation theorem. For non mean variance portfolio analysis, see Marginal conditional stochastic dominance. Modern portfolio theory (MPT) … Wikipedia
systems engineering — ☆ systems engineering n. a branch of engineering using esp. information theory, computer science, and facts from systems analysis studies to design integrated operational systems for specific complexes systems engineer n. * * * Technique of using … Universalium
Evolutionary informatics — is a subfield of informatics addressing the practice of information processing in, and the engineering of information systems for, the study of biological evolution, as well as the study of information in evolutionary systems, natural and… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Russia — /rush euh/, n. 1. Also called Russian Empire. Russian, Rossiya. a former empire in E Europe and N and W Asia: overthrown by the Russian Revolution 1917. Cap.: St. Petersburg (1703 1917). 2. See Union of Soviet Socialist Republics. 3. See Russian… … Universalium
Artificial neural network — An artificial neural network (ANN), usually called neural network (NN), is a mathematical model or computational model that is inspired by the structure and/or functional aspects of biological neural networks. A neural network consists of an… … Wikipedia
John von Neumann — Von Neumann redirects here. For other uses, see Von Neumann (disambiguation). The native form of this personal name is Neumann János. This article uses the Western name order. John von Neumann … Wikipedia
Cluster analysis — The result of a cluster analysis shown as the coloring of the squares into three clusters. Cluster analysis or clustering is the task of assigning a set of objects into groups (called clusters) so that the objects in the same cluster are more… … Wikipedia